Generating Discrete Planes with Substitutions

نویسندگان

  • Valérie Berthé
  • Jérémie Bourdon
  • Timo Jolivet
  • Anne Siegel
چکیده

Given a finite set S of unimodular Pisot substitutions, we provide a method for characterizing the infinite sequences over S that allow to generate a full discrete plane when, starting from a finite seed, we iterate the multidimensional dual substitutions associated with S. We apply our results to study the substitutions associated with the Brun multidimensional continued fraction algorithm.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generation of discrete planes

We consider the problem of generation of discrete planes using generalized substitutions. We give sufficient conditions to be sure to generate all of a discrete plane by a sequence of substitutions; these conditions, however, are not easy to check, even on simple examples. One can build approximations of discrete planes in several ways, namely as stepped surfaces (unions of faces), as sets of v...

متن کامل

Brun expansions of stepped surfaces

Dual maps have been introduced as a generalization to higher dimensions of word substitutions and free group morphisms. In this paper, we study the action of these dual maps on particular discrete planes and surfaces – namely stepped planes and stepped surfaces. We show that dual maps can be seen as discretizations of toral automorphisms. We then provide a connection between stepped planes and ...

متن کامل

MODELLING AND ANALYSIS OF A DISCRETE-TIME PRIORITY QUEUING COMPUTER NETWORK WITH PRIORITY JUMPS USING PROBABILITY GENERATING FUNCTIONS

Priority queues have a great importance in the study of computer communication networks in which different types of traffic require different quality of service standards. The discrete-time non-preemptive priority queuing model with priority jumps is proposed in this paper. On the basis of probability generating functions mean system contents and mean queuing delay characteristics are obtained....

متن کامل

Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton

Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

متن کامل

On some applications of generalized functionality for arithmetic discrete planes

Naive discrete planes are well known to be functional on a coordinate plane. The aim of our paper is to extend the functionality concept to a larger family of arithmetic discrete planes, by introducing suitable projection directions (α1, α2, α3) satisfying α1v1 +α2v2 +α3v3 = w. Several applications are considered. We first study certain local configurations, that is, the (m,n)-cubes introduced ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013